#include<vector>

int search(std::vector<int>& nums, int target) {
    int n = nums.size();
    int left = 0, right = n;
    while (left < right)
    {
        int mid = (left + right) / 2;
        if (nums[mid] < target) left = mid + 1;
        else if (nums[mid] > target) right = mid;
        else return mid;
    }
    return -1;
}

int main()
{


	return 0;
}